TIIS (한국인터넷정보학회)
Current Result Document :
| 한글제목(Korean Title) |
Knowledge Representation Using Decision Trees Constructed Based on Binary Splits |
| 영문제목(English Title) |
Knowledge Representation Using Decision Trees Constructed Based on Binary Splits |
| 저자(Author) |
Mohammad Azad
|
| 원문수록처(Citation) |
VOL 14 NO. 10 PP. 4007 ~ 4024 (2020. 10) |
한글내용
(Korean Abstract) |
|
영문내용
(English Abstract) |
It is tremendously important to construct decision trees to use as a tool for knowledge representation from a given decision table. However, the usual algorithms may split the decision table based on each value, which is not efficient for numerical attributes. The methodology of this paper is to split the given decision table into binary groups as like the CART algorithm, that uses binary split to work for both categorical and numerical attributes. The difference is that it uses split for each attribute established by the directed acyclic graph in a dynamic programming fashion whereas, the CART uses binary split among all considered attributes in a greedy fashion. The aim of this paper is to study the effect of binary splits in comparison with each value splits when building the decision trees. Such effect can be studied by comparing the number of nodes, local and global misclassification rate among the constructed decision trees based on three proposed algorithms.
|
| 키워드(Keyword) |
Knowledge representation
decision trees
binary split
directed acyclic graph
|
| 파일첨부 |
PDF 다운로드
|
